Multiple Relaxations in Temporal Planning
نویسندگان
چکیده
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classical planning phase. Relaxations in planning are used to guide the search. However, the quality of the relaxation greatly affects the performance of the planner, and in some cases can lead the search into a dead end. This can happen whilst separating out the planning and scheduling problems, leading to the production of an unschedulable plan. CRIKEY can detect these cases and change the relaxation accordingly.
منابع مشابه
Resolving Uncontrollable Conditional Temporal Problems Using Continuous Relaxations
Uncertainty is commonly encountered in temporal scheduling and planning problems, and can often lead to over-constrained situations. Previous relaxation algorithms for over-constrained temporal problems only work with requirement constraints, whose outcomes can be controlled by the agents. When applied to uncontrollable durations, these algorithms may only satisfy a subset of the random outcome...
متن کاملMonotone Temporal Planning: Tractability, Extensions and Applications
This paper describes a polynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal fluents allows us to express planning as an instance of STP ≠ (Simple Tempor...
متن کاملResolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation
Over-subscription, that is, being assigned too many things to do, is commonly encountered in temporal scheduling problems. As human beings, we often want to do more than we can actually do, and underestimate how long it takes to perform each task. Decision makers can benefit from aids that identify when these failure situations are likely, the root causes of these failures, and resolutions to t...
متن کاملDelete-Free Reachability Analysis for Temporal and Hierarchical Planning
Reachability analysis is a crucial part of the heuristic computation for many state of the art classical and temporal planners. In this paper, we study the difficulty that arises in assessing the reachability of actions in planning problems containing sets of interdependent actions, notably including problems with required concurrency as well as hierarchical planning problems. In temporal plann...
متن کاملDelete-free Reachability Analysis for Temporal and Hierarchical Planning (full version)
Reachability analysis is a crucial part of the heuristic computation for many state of the art classical and temporal planners. In this paper, we study the difficulty that arises in assessing the reachability of actions in planning problems containing sets of interdependent actions, notably including problems with required concurrency as well as hierarchical planning problems. In temporal plann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004